Preference-constrained Oriented Matching
نویسندگان
چکیده
We introduce and study a combinatorial problem called preference-constrained oriented matching. This problem is defined on a directed graph in which each node has preferences over its out-neighbors, and the goal is to find a maximum-size matching on this graph that satisfies a certain preference constraint. One of our main results is a structural theorem showing that if the given graph is complete, then for any preference ordering there always exists a feasible matching that covers a constant fraction of the nodes. This result allows us to correct an error in a proof by Azar, Jain, and Mirrokni [1], establishing a lower bound on the price of anarchy in coordination mechanisms for scheduling. We also show that the preference-constrained oriented matching problem is APX-hard and give a constant-factor approximation algorithm for it.
منابع مشابه
CREDIBILITY THEORY ORIENTED PREFERENCE INDEX FOR RANKING FUZZY NUMBERS
This paper suggests a novel approach for ranking the most applicable fuzzy numbers, i.e. $LR$-fuzzy numbers. Applying the $alpha$-optimistic values of a fuzzy number, a preference criterion is proposed for ranking fuzzy numbers using the Credibility index. The main properties of the proposed preference criterion are also studied. Moreover, the proposed method is applied for ranking fuzz...
متن کاملMatching and Uniication for the Object-oriented Symbolic Computation System
Term matching has become one of the most important primitive operations for symbolic computation. This paper describes the extension of the object-oriented symbolic computation system AlgBench with pattern matching and uniication facilities. The various pattern objects are organized in subclasses of the class of the composite expressions. This leads to a clear design and to a distributed implem...
متن کاملMatchmaking for Semantic Web Services with Constraints on Process Models
-. Service discovery is part of the service-oriented architectural model and supported by any of the realising technologies including Web Services. This paper presents an agent-based system for discovering semantic Web Services whose behaviour is described by OWL-S process model. Rules can be set to constrain service processes, and criteria for considering matching between a service process and...
متن کاملSoft Constraints in Stable Matching Problems
The stable matching problem has many practical applications in two-sided markets, like those that assign doctors to hospitals, students to schools, or buyers to vendors. Usually it is assumed that the participants of one side explicitly express a preference ordering over all those on the other side. This can be unfeasible when the number of options is large or has a combinatorial structure. We ...
متن کاملSurvey of Preference Elicitation Methods
As people increasingly rely on interactive decision support systems to choose products and make decisions, building effective interfaces for these systems becomes more and more challenging due to the explosion of on-line information, the initial incomplete user preference and user’s cognitive and emotional limitations of information processing. How to accurately elicit user’s preference thereby...
متن کامل